Game Theory Meets Theoretical Computer Science
نویسندگان
چکیده
منابع مشابه
Coding Theory Meets Theoretical Computer Science
Theoretical computer scientists have been plying their skills in coding theory since the late 1980s, focusing primarily on the design of faster decoding algorithms. Over the last few years, techniques have begun to flow in the other direction as well, with errorcorrecting codes proving to be useful tools for the solution of problems in theoretical computer science. Ample evidence of the flows i...
متن کاملAutomata in SageMath — Combinatorics meets Theoretical Computer Science
You might ask now: Why?—Why exactly this?—A small hint: It has to do with multiplication as the title of the first act says. Already guessed?—Yes?—No?—Then, here is the answer. Suppose that we want to multiply a huge number n by 9999. Suddenly today’s guest list becomes clearer. Such a multiplication should not be done according to the schoolbook, but just by subtracting n from 10000n. Since no...
متن کاملComputer Science Meets Medical Science
In the past 20–30 years at least two technical advances have made quantification in pathology at a large scale possible. At the time the computing power of affordable computers increased, interest to deploy tasks emerged that were previously very laborious to perform. Combined with digital camera systems, many new possibilities became available. Examples of such measurements that were previousl...
متن کاملTopology, Domain Theory and Theoretical Computer Science
In this paper, we survey the use of order-theoretic topology in theoretical computer science, with an emphasis on applications of domain theory. Our focus is on the uses of order-theoretic topology in programming language semantics, and on problems of potential interest to topologists that stem from concerns that semantics generates.
متن کاملCompressed Sensing Meets Game Theory
We introduce the MUSE Algorithm and prove that for any ksparse vector α∗, any measurement matrix Φ, and any noise vector ε, given f = Φα∗ + ε, the proposed algorithm finds a k-sparse vector α̂ such that ∥Φα̂−f∥∞ ≤ ∥ε∥∞+O ( 1 √ k ) . The proposed algorithm is based on reformulating the sparse approximation problem as a zero-sum game over a properly chosen new space. If the projection matrix satisf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.05.004